Distance Polynomial and the Related Counting Polynomials
نویسندگان
چکیده
منابع مشابه
On the distance from a matrix polynomial to matrix polynomials with two prescribed eigenvalues
Consider an n × <span style="fon...
متن کاملThe Tutte polynomial and related polynomials
The Tutte polynomial was defined originally for graphs and extends to more generally to matroids. The many natural combinatorial interpretations of its evaluations and coefficients for graphs then translate to not obviously related combinatorial quantities in other matroids. For example, the Tutte polynomial evaluated at (2, 0) gives the number of acyclic orientations of a graph. Zaslavsky prov...
متن کاملOn Counting Polynomials of Some Nanostructures
The Omega polynomial(x) was recently proposed by Diudea, based on the length of strips in given graph G. The Sadhana polynomial has been defined to evaluate the Sadhana index of a molecular graph. The PI polynomial is another molecular descriptor. In this paper we compute these three polynomials for some infinite classes of nanostructures.
متن کاملNonsymmetric Askey-Wilson polynomials and Q-polynomial distance-regular graphs
In his famous theorem (1982), Douglas Leonard characterized the q-Racah polynomials and their relatives in the Askey scheme from the duality property of Q-polynomial distance-regular graphs. In this paper we consider a nonsymmetric (or Laurent) version of the q-Racah polynomials in the above situation. Let Γ denote a Q-polynomial distance-regular graph that contains a Delsarte clique C. Assume ...
متن کاملAlgebraic adjoint of the polynomials-polynomial matrix multiplication
This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Croatica Chemica Acta
سال: 2013
ISSN: 0011-1643,1334-417X
DOI: 10.5562/cca2311